Predictive Shape Coding Using Generic Polygon Approximation
نویسندگان
چکیده
We introduce an e cient predictive binary shape coding method that consists of (1) global motion estimation, (2) local motion estimation, (3) matched segment coding, and (4) residual segment coding. Global and local motion estimation use contour pel matching and knowledge of previously reconstructed contours. After motion compensation, we code the one-dimensional reference contour indices of the matched contour positions. The nal step codes the mismatched contour segments using residual coding. We use a maximum shape distortion tolerance parameter (dmax), which is zero for lossless coding, for both motion estimation and residual coding. We apply the new shape coding method to MPEG-4 binary mask test sequences in QCIF and SIF formats for a wide range of dmax values. The key contribution of our method is in lossy shape coding in which the average coding gain is more than 100% over generalized di erential chain coding. The proposed scheme can be applied to MPEG-4 compliant shape coding and to e cient shape representation for future MPEG-7 applications.
منابع مشابه
International Organization for Standardization Organisation Internationale De Normalisation Iso/iec Jtc1/sc29/wg11 Coding of Moving Pictures and Associated Audio
Polygon/spline approximation of arbitrary image region shapes is submitted for tool evaluation. First, polygon approximation is performed. Starting with an initial 4–vertices polygon which represents the farest elongations into different directions, the polygon approximation is iteratively refined taking into account the local requirements until a given tolerance criterion is satisfied everywhe...
متن کاملHierarchical Shape-Adaptive Quantization for Geometry Compression
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on predictive coding. Instead of using the vertex to vertex distance as distortion measurement, an approximation to the Hausdorffdistance is used resulting in additional degrees of freedom. These are exploited by a new adapti...
متن کاملOptimization and Tracking of Polygon Vertices for Shape Coding
The efficiency of shape coding is an important problem in low-bitrate object-based video compression. Lossy contour coding methods typically include contour approximation by polygons or splines, spatial and/or temporal prediction of vertices, and entropy coding the of prediction error. In conventional contour coding schemes, however, the coding gain in the interframe mode is typically small. Th...
متن کاملQuasi-Bezier Curves Integrating Localised Information (For Vertex-based shape coding)
Gour C. Karmakar, Laurence S. Dooley, and John Arkinstall Bezier curves (BC) have become fundamental tools in many challenging and varied applications, ranging from computer aided geometric design to generic object shape descriptors. A major limitation of the classical Bezier curve however, is that only global information about its control points (CP) is considered, so there can often be a larg...
متن کاملQuasi-Bezier curves integrating localised information
Bezier curves (BC) have become fundamental tools in many challenging and varied applications, ranging from computer aided geometric design to generic object shape descriptors. A major limitation of the classical Bezier curve however, is that only global information about its control points (CP) is considered, so there can often be a large gap between the curve and its control polygon, leading t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998